Linkless Embeddings of Graphs in 3-space
نویسندگان
چکیده
We announce results about flat (linkless) embeddings of graphs in 3space. A piecewise-linear embedding of a graph in 3-space is called flat if every circuit of the graph bounds a disk disjoint from the rest of the graph. We have shown: (i) An embedding is flat if and only if the fundamental group of the complement in 3-space of the embedding of every subgraph is free. (ii) If two flat embeddings of the same graph are not ambient isotopic, then they differ on a subdivision of K5 or K3,3. (iii) Any flat embedding of a graph can be transformed to any other flat embedding of the same graph by “3-switches”, an analog of 2-switches from the theory of planar embeddings. In particular, any two flat embeddings of a 4-connected graph are either ambient isotopic, or one is ambient isotopic to a mirror image of the other. (iv) A graph has a flat embedding if and only if it has no minor isomorphic to one of seven specified graphs. These are the graphs that can be obtained from K6 by means of Y∆and ∆Y -exchanges.
منابع مشابه
Linkless and Flat Embeddings in 3-space in Quadratic Time
We consider embeddings of graphs in the 3-space R (all embeddings inthis paper are assumed to be piecewise linear). An embbeding of a graph in R3 is linkless if every pair of disjoint cycles forms a trivial link (in the senseof knot theory), i.e., each of the two cycles (in R) can be embedded in aclosed topological 2-disk disjoint from the other cycle. Robertson, Seymour and...
متن کاملPrimitive Spatial Graphs and Graph Minors
Robertson, Seymour and Thomas characterized linkless embeddings of graphs by flat embeddings, and determined the obstruction set for linkless embeddings. In this paper, we extend flat embeddings to “primitive embeddings” as linkless embeddings to knotless embeddings. Although the obstruction set for knotless embeddings has not been determined, fundamental theorems and conjectures are obtained.
متن کاملRecent Excluded Minor Theorems for Graphs
A graph is a minor of another if the first can be obtained from a subgraph of the second by contracting edges. An excluded minor theorem describes the structure of graphs with no minor isomorphic to a prescribed set of graphs. Splitter theorems are tools for proving excluded minor theorems. We discuss splitter theorems for internally 4-connected graphs and for cyclically 5-connected cubic graph...
متن کاملLabeling Subgraph Embeddings and Cordiality of Graphs
Let $G$ be a graph with vertex set $V(G)$ and edge set $E(G)$, a vertex labeling $f : V(G)rightarrow mathbb{Z}_2$ induces an edge labeling $ f^{+} : E(G)rightarrow mathbb{Z}_2$ defined by $f^{+}(xy) = f(x) + f(y)$, for each edge $ xyin E(G)$. For each $i in mathbb{Z}_2$, let $ v_{f}(i)=|{u in V(G) : f(u) = i}|$ and $e_{f^+}(i)=|{xyin E(G) : f^{+}(xy) = i}|$. A vertex labeling $f$ of a graph $G...
متن کاملA polynomial-time algorithm to find a linkless embedding of a graph
A Z-linkless embedding of a graph is an embedding in 3-space such that each pair of disjoint circuits has zero linking number. In this paper we present polynomial-time algorithms to compute a Z-linkless embedding of a graph provided the graph has one and to test whether an embedding of a graph is Z-linkless or not.
متن کامل